Unary profile of lambda terms with restricted De Bruijn indices
نویسندگان
چکیده
In this paper we present an average-case analysis of closed lambda terms with restricted values De Bruijn indices in the model where each occurrence a variable contributes one to size. Given fixed integer k, term which all are bounded by k has following shape: It starts levels, forming so-called hat term, some number k-colored Motzkin trees attached. By means analytic combinatorics, show that size is constant on average and levels n asymptotically Θ(√ n). Combining these two facts, conclude maximal non-empty level restrictions is, average, also order √ n. On basis, provide unary profile such terms.
منابع مشابه
Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices
We introduce a compressed de Bruijn representation of lambda terms and define its bijections to standard representations. Our compressed terms facilitate derivation of size-proportionate ranking and unranking algorithms of lambda terms and their inferred simple types. We specify our algorithms as a literate Prolog program.
متن کاملOn Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization
We introduce a compressed de Bruijn representation of lambda terms and define its bijections to standard representations. Compact combinatorial generation algorithms are given for several families of lambda terms, including open, closed, simply typed and linear terms as well as type inference and normal order reduction algorithms. We specify our algorithms as a literate Prolog program. In the p...
متن کاملLambda-terms of Bounded Unary Height
We aim at the asymptotic enumeration of lambda-terms of a given size where the order of nesting of abstractions is bounded whereas the size is tending to infinity. This is done by means of a generating function approach and singularity analysis. The generating functions appear to be composed of nested square roots which exhibit unexpected phenomena. We derive the asymptotic number of such lambd...
متن کاملOn the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation
John Tromp introduced the so-called ’binary lambda calculus’ as a way to encode lambda terms in terms of binary words. Later, Grygiel and Lescanne conjectured that the number of binary lambda terms with m free indices and of size n (encoded as binary words of length n) is o ( n−3/2τ−n ) for τ ≈ 1.963448 . . .. We generalize the proposed notion of size and show that for several classes of lambda...
متن کاملPure Type Systems with de Bruijn Indices
Nowadays, type theory has many applications and is used in many different disciplines. Within computer science, logic and mathematics there are many different type systems. They serve several purposes and are formulated in various ways. A general framework called Pure Type Systems (PTSs) has been introduced independently by Terlouw and Berardi in order to provide a unified formalism in which ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics & Theoretical Computer Science
سال: 2021
ISSN: ['1365-8050', '1462-7264']
DOI: https://doi.org/10.46298/dmtcs.5836